Lecture Notes in Computer Science: Multiple DNA Sequence Alignment Using Joint Weight Matrix

نویسندگان

  • Jian-Jun Shu
  • Kian Yan Yong
  • Weng Kong Chan
چکیده

The way for performing multiple sequence alignment is based on the criterion of the maximum scored information content computed from a weight matrix, but it is possible to have two or more alignments to have the same highest score leading to ambiguities in selecting the best alignment. This paper addresses this issue by introducing the concept of joint weight matrix to eliminate the randomness in selecting the best alignment of multiple sequences. Alignments with equal scores are iteratively re-scored with joint weight matrix of increasing level (nucleotide pairs, triplets and so on) until one single best alignment is eventually found. This method can be easily implemented to algorithms using weight matrix for scoring such as those based on the widely used Gibbs sampling method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple DNA Sequence Alignment Using Joint Weight Matrix

The way for performing multiple sequence alignment is based on the criterion of the maximum scored information content computed from a weight matrix, but it is possible to have two or more alignments to have the same highest score leading to ambiguities in selecting the best alignment. This paper addresses this issue by introducing the concept of joint weight matrix to eliminate the randomness ...

متن کامل

Comparison of Genomic DNA to cDNA Alignment Methods

Aligning cDNA sequences to genomic sequences is a very common way to study expressed sequences, find their genes, and study alternative splicing. Several computer programs address this problem, using heuristics to define exon regions. Usually, standard alignment algorithms are not used to align ESTs to genomic DNA, due to the existence of large regions of introns. This paper compares the EST-to...

متن کامل

gpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences

Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...

متن کامل

Analysis of the Effects of Multiple Sequence Alignments in Protein Secondary Structure Prediction

Secondary structure prediction methods are widely used bioinformatics algorithms providing initial insights about protein structure from sequence information. Significant efforts to improve the prediction accuracy over the past years were made, specially the incorporation of information from multiple sequence alignments. This motivated the search for the factors contributing for this improvemen...

متن کامل

Constrained pairwise and center-star sequences alignment problems

Sequence alignment is a fundamental problem in computational biology, which is also important in theoretical computer science. In this paper, we consider the problem of aligning a set of sequences subject to a given constrained sequence. A preliminary version of this paper appeared in the Proceedings of the 8th International Frontiers of Algorithmics Workshop (FAW 2014) Lecture Notes in Compute...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011